-
1 generator polynomial
English-Russian cryptological dictionary > generator polynomial
-
2 generator polynomial
порождающий полином (полином, используемый для получения каких-либо кодовых последовательностей)Англо-русский словарь промышленной и научной лексики > generator polynomial
-
3 полиномиальная образующая
polynomial generator мат.Русско-английский научно-технический словарь Масловского > полиномиальная образующая
-
4 полиномиальная образующая
Mathematics: polynomial generatorУниверсальный русско-английский словарь > полиномиальная образующая
-
5 полином генератора
полином генератора
Полином, который является делителем всех полиномов кодовых слов в циклическом блочном коде. Такой полином описывает схему генератора и его обратных связей в сверточном коде.
[Л.М. Невдяев. Телекоммуникационные технологии. Англо-русский толковый словарь-справочник. Под редакцией Ю.М. Горностаева. Москва, 2002]Тематики
- электросвязь, основные понятия
EN
Русско-английский словарь нормативно-технической терминологии > полином генератора
-
6 образующий полином
Russian-English dictionary of telecommunications > образующий полином
-
7 порождающий многочлен
Russian-English dictionary of telecommunications > порождающий многочлен
-
8 порождающий полином
Русско-английский словарь по электронике > порождающий полином
-
9 порождающий полином
Русско-английский словарь по радиоэлектронике > порождающий полином
-
10 порождающий многочлен
1) Mathematics: generator polynomial2) Information technology: generating polynomialУниверсальный русско-английский словарь > порождающий многочлен
-
11 образующий полином
Telecommunications: generator polynomialУниверсальный русско-английский словарь > образующий полином
См. также в других словарях:
Polynomial code — In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator… … Wikipedia
Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… … Wikipedia
Pseudorandom generator — In theoretical computer science, a pseudorandom generator is a deterministic method of generating a large amount of pseudorandom, or apparently random, data, from a small amount of initial random data. The initial data is commonly known as a… … Wikipedia
Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… … Wikipedia
Cryptographically secure pseudorandom number generator — A cryptographically secure pseudo random number generator (CSPRNG) is a pseudo random number generator (PRNG) with properties that make it suitable for use in cryptography. Many aspects of cryptography require random numbers, for example: Key… … Wikipedia
Alexander polynomial — In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type. James Waddell Alexander II discovered this, the first knot polynomial, in 1923. In 1969, John Conway showed a… … Wikipedia
Jones polynomial — In the mathematical field of knot theory, the Jones polynomial is a knot polynomial discovered by Vaughan Jones in 1983. Specifically, it is an invariant of an oriented knot or link which assigns to each oriented knot or link a Laurent polynomial … Wikipedia
Lagged Fibonacci generator — A Lagged Fibonacci generator (LFG) is an example of a pseudorandom number generator. This class of random number generator is aimed at being an improvement on the standard linear congruential generator. These are based on a generalisation of the… … Wikipedia
Pseudorandom number generator — A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG),[1] is an algorithm for generating a sequence of numbers that approximates the properties of random numbers. The sequence is not truly random in… … Wikipedia
Self-shrinking generator — A self shrinking generator is a pseudorandom number generator and a variant of the shrinking generator concept. It is a generator used in cryptography and has reasonable security properties when used in conjunction with a Linear feedback shift… … Wikipedia
Alternating step generator — In cryptography, an alternating step generator (ASG) is a cryptographic pseudorandom number generator intended to be used in a stream cipher. The design was published in 1987 by C. G. Günther. It is also known as the alternating stop and go… … Wikipedia